Complexity among the finitely generated subgroups of Thompson's group
نویسندگان
چکیده
Funding: Acknowledgements. The authors would also like to thank the referee for their very careful and thorough reading of paper. This publication is in part a product visit first third author Mathematisches Forschungsinstitut Oberwolfach, Germany December 2016 as Research In Pairs program. was partially supported by NSF grants DMS–1600635 DMS-1854367.
منابع مشابه
The Modular Group A Finitely Generated Group with Interesting Subgroups
The action of Möbius transformations with real coefficients preserves the hyperbolic metric in the upper half-plane model of the hyperbolic plane. The modular group is an interesting group of hyperbolic isometries generated by two Möbius transformations, namely, an order-two element, g2 HzL = -1 ê z, and an element of infinite order, g• HzL = z + 1. Viewing the action of the group elements on a...
متن کاملRandom Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be obtained by the method of Stallings foldings. Our algorithm randomly generates a subgroup of a given size n, according to the uniform distribution over size n ...
متن کاملCounting for conjugacy classes of subgroups in finitely generated group ∗
A new general formula for calculation of number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
متن کاملOn Intersections of Finitely Generated Subgroups of Free Groups
and asked if the factor 2 can be dropped. If one translates her approach (which is a slight modification of Howson's) to graph-theoretic terms, it easily shows that the answer is often "yes"in fact, for most U the answer is "yes" for all V. According to Gersten [G], the above problem has come to be known as the "Haana Neumann Conjecture." Using ideas of immersions of graphs originating from Sta...
متن کامل2 00 4 Counting conjugacy classes of subgroups in a finitely generated group ∗
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of combinatorial algebra
سال: 2021
ISSN: ['2415-6302', '2415-6310']
DOI: https://doi.org/10.4171/jca/49